Transitive Avoidance Games

نویسندگان

  • J. Robert Johnson
  • Imre Leader
  • Mark Walters
چکیده

Positional games are a well-studied class of combinatorial games. In their usual form, two players take turns to play moves in a set (‘the board’), and certain subsets are designated as ‘winning’: the first person to occupy such a set wins the game. For these games, it is well known that (with correct play) the game cannot be a second-player win. In the avoidance (or misère) form, the first person to occupy such a set loses the game. Here it would be natural to expect that the game cannot be a first-player win, at least if the game is transitive, meaning that all points of the board look the same. Our main result is that, contrary to this expectation, there are transitive games that are first-player wins, for all board sizes which are not prime or a power of 2. Further, we show that such games can have additional properties such as stronger transitivity conditions, fast winning times, and ‘small’ winning sets. the electronic journal of combinatorics 24(1) (2017), #P1.61 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

رابطه اجتناب تجربه ای، جو عاطفی خانواده و خودکنترلی با اعتیاد به بازی های آنلاین در دانشجویان دانشگاه شهید چمران اهواز

Background and Objectives: online game addiction is considered as a compulsive, excessive, uncontrollable and destructive physical and psychological behavior. With regard to the problem of persons with addiction to online gaming in the fields of experiential avoidance, families emotional atmosphere and self-control, this study was carried out with the aim of determining the relationship of expe...

متن کامل

The Ehrenfeucht-Fraisse Games for Transitive Closure

We present in this paper Ehrenfeucht-Frai"sse games for the transitiveclosure logics DTC, TC and ATC. Although the existence of such games for logics with generalized quantifiers was known before, the exact formulation of these games for the predicate transformers arising from various transitive-closure-like operations is new. The games are sound and complete both for finite and infinite models...

متن کامل

Graph Ramsey games

We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In avoidance games, completing a monochromatic subgraph isomorphic to another graph A leads to immediate defeat or is forbidden and the first player that cannot move...

متن کامل

Solitaire Games ∗

The model-checking games associated with fixed-point logics are parity games, and it is currently not known whether the strategy problem for parity games can be solved in polynomial time. We study Solitaire-LFP, a fragment of least fixedpoint logic, whose evaluation games are nested soltaire games. This means that on each strongly connected component of the game, only one player can make nontri...

متن کامل

Core of Combined Games *

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017